Rank axiom of modular supermatroids: A connection with directional DR submodular functions

نویسندگان

چکیده

A matroid has been one of the most important combinatorial structures since it was introduced by Whitney as an abstraction linear independence. As property a matroid, can be characterized several different (but equivalent) axioms, such augmentation, base exchange, or rank axiom. supermatroid is generalization defined on lattices. Here, central question whether equivalent axioms similar to matroid. Barnabei, Nicoletti, and Pezzoli supermatroids distributive lattices, Fujishige, Koshevoy, Sano generalized results for cg-matroids (supermatroids lower locally lattices). In this study, we focus modular which are superclass provide characterizations We characterize lattices using axiom in function directional DR-submodular function, submodular authors. Using characterization based functions, further prove strong exchange supermatroid, application optimization. also reveal relation between semimodular common lattice lattice.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid

Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...

متن کامل

Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints

We consider the problem of maximizing a nonmonotone DR-submodular function subject to a cardinality constraint. Diminishing returns (DR) submodularity is a generalization of the diminishing returns property for functions defined over the integer lattice. This generalization can be used to solve many machine learning or combinatorial optimization problems such as optimal budget allocation, reven...

متن کامل

A Proportionally Submodular Functions

Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions, which we call proportionally submodular functions. Our extension includes some (mildly) supermodular functions. We show that several natural functions belong to ...

متن کامل

Applications of Submodular Functions

Submodular functions and related polyhedra play an increasing role in combinatorial optimization. The present survey-type paper is intended to provide a brief account of this theory along with several applications in graph theory and combinatorial optimization.

متن کامل

Non-Monotone DR-Submodular Function Maximization

We consider non-monotone DR-submodular function maximization, where DR-submodularity (diminishing return submodularity) is an extension of submodularity for functions over the integer lattice based on the concept of the diminishing return property. Maximizing non-monotone DRsubmodular functions has many applications in machine learning that cannot be captured by submodular set functions. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2022

ISSN: ['1090-2074', '0196-8858']

DOI: https://doi.org/10.1016/j.aam.2021.102304